package 二叉树.m03.d13.t04;

import 二叉树.m03.TreeNode;

class Solution {
    public boolean isBalanced(TreeNode root) {
        if(root == null) return true;
        return (Math.abs(maxDepth(root.left)-maxDepth(root.right))<=1)&&
        isBalanced(root.left)&&isBalanced(root.right);
    }
    public int maxDepth(TreeNode root) {
        if(root == null) return 0;
        return Math.max(maxDepth(root.left), maxDepth(root.right))+1;
    }
}